Parallelization of Modified Merge Sort Algorithm
نویسندگان
چکیده
منابع مشابه
Parallelization of Modified Merge Sort Algorithm
Modern architectures make possible development in new algorithms for large data sets and distributed computing. The newly proposed versions can benefit both from faster computing on the multi core architectures, and intelligent programming techniques that use efficient procedures available in the latest programming studios. Frequently used algorithms to sort arrays of data in NoSQL databases is...
متن کاملModified Merge Sort Algorithm
Given a sequence of N elements a1, a2, a3, ..., aN. The desired output will be a’1, a’2, a’3,..., a’N such that a’1≤, a’2≤, a’3≤...≤a’N using merge sort. In this paper, we propose a modification to the existing merge sort algorithm to sort the given elements when the input sequence (or a part of it) is in ascending or descending order in a more efficient way by reducing the number of comparison...
متن کاملMerge Sort Algorithm
Given an array with n elements, we want to rearrange them in ascending order. Sorting algorithms such as the Bubble, Insertion and Selection Sort all have a quadratic time complexity that limits their use when the number of elements is very big. In this paper, we introduce Merge Sort, a divide-andconquer algorithm to sort an N element array. We evaluate the O(NlogN) time complexity of merge sor...
متن کاملLate-Materialization using Sort-merge Join Algorithm
1. Daniel J. Abadi ,Daniel S. Myers, David J. DeWitt, Samuel R. Madden. Materialization Strategies in a Column-Oriented DBMS. Proceedings of ICDE 2007, Istanbul, Turkey. 2. Daniel J. Abadi, Samuel R. Madden, Nabil hachem. Column-Store vs Row-store How different are they really? SIGMOD’08, June 9–12, 2008, Vancouver, BC, Canada 3. Daniel Abadi,PeterBoncz,Stavros Harizopoulos, Stratos Idreos, Sam...
متن کاملMerge Sort
Bingheng Wang Dept. of Computer Science Florida Institute of Technology Melbourne FL 32904 [email protected] ABSTRACT Given a list of elements, we rearrange the list with ascending or descending order. So far the existing approaches involve Bubble Sort, Insertion Sort, Selection Sort ( respectively in worst case) performing slow. Now we introduce a new algorithm Merge Sort to solve the problem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2017
ISSN: 2073-8994
DOI: 10.3390/sym9090176